Tow-down Induction of Logic Programs from Incomplete Samples
نویسندگان
چکیده
We propose an ILP system FOIL-I, which induces logic programs by a top-down method from incomplete samples. An incomplete sample is constituted by some of positive examples and negative examples on a nite domain. FOIL-I has an evaluation function to estimate candidate de nitions, the function which is composition of an information-based function and an encoding complexity measure. FOILI uses a bestrst search using the evaluation function to make use of suspicious but necessary candidates. Other particular points include a treatment for recursive de nitions and removal of redundant clauses. Randomly selected incomplete samples are tested with FOIL-I, Quinlan's FOIL and Muggleton's Progol. Compared with others FOIL-I can induce target relations in many cases from small incomplete samples.
منابع مشابه
Iterative Induction of Logic Programs, An approach to logic program synthesis from incomplete specifications
متن کامل
Learning with Abduction
We investigate how abduction and induction can be integrated into a common learning framework through the notion of Abductive Concept Learning (ACL). ACL is an extension of Inductive Logic Programming (ILP) to the case in which both the background and the target theory are abductive logic programs and where an abductive notion of entailment is used as the coverage relation. In this framework, i...
متن کاملLogic Program Synthesis from Incomplete Specifications
Program synthesis research aims at maximally automating the passage from specifications to programs (see the survey by Biermann, 1992). We define possible formalisms for the starting points (specifications: see Section 1.1) and results (programs: see Section 1.2) of synthesis, and state existing approaches and related work, before pinning down the objectives (Section 1.3) of this paper. Some fa...
متن کاملInductive Metalogic Programming 1
We propose a metalogic programming method for eecient induction of a fairly large class of list-handling logic programs delineated through restrictions on the hypothesis language. These restrictions take the form of predeened program recursion schemes (higher order \clich es") from which the hypotheses programs in the induction process are derived by plugging in either simple, nonrecursive clau...
متن کاملIntegrating Abduction and Induction
We propose an approach for the integration of abduction and induction in the context of Logic Programming. The integration is obtained by extending an Inductive Logic Programming system with abductive reasoning capabilities. In the resulting system, abduction is used to make assumptions in order to cover positive examples and avoid the coverage of negative ones. The assumptions generated can th...
متن کامل